Efficient routing optimization with discrete penguins search algorithm for MTSP

The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to class of problems known as NP-hard, which an exceptional case travelling salesman (TSP), determines set routes enabling multiple salesmen start at and return home cities (depots). penguins search algorithm (PeSOA) new metaheuristic algorithm. In this paper, we present discrete for solving the (MTSP). PeSOA evaluated by benchmarks TSP instance from TSPLIB library. experimental results show very efficient in finding right solutions reasonable time